Source Coding for Campbell’s Penalties
نویسنده
چکیده
Given a probability vector, Huffman coding finds a corresponding prefix-free binary code that minimizes the mean codeword length. In this paper we explore situations in which the goals are different from those in Huffman coding. We explore a family of penalties (generalized means) proposed by Campbell [8], finding redundancy bounds for a common subfamily. We generalize an efficient algorithm for finding length-limited codes [20] to an efficient algorithm for finding optimal codes for any convex Campbell cost. This algorithm, which also applies to a broader family of problems, can be performed using quadratic time and linear space.
منابع مشابه
THE SpEnt METHOD FOR LOSSY SOURCE CODING †
At present, the most successful methods for lossy source compression are sample-function adaptive coders. Prominent examples of these techniques are the still image compression methods utilizing wavelet expansions and tree structures, such as the zero-tree method or the SPIHT algorithm, and variable rate speech coders that allocate bits to parameters within a frame based upon the classification...
متن کاملPath Coding Penalties for Directed Acyclic Graphs
We consider supervised learning problems where the features are embedded in a graph, such as gene expressions in a gene network. In this context, it is of much interest to automatically select a subgraph which has a small number of connected components, either to improve the prediction performance, or to obtain better interpretable results. Existing regularization or penalty functions for this ...
متن کاملMedieval Origins: A Review Essay on Campbell’s The Great Transition
Campbell’s The Great Transition is a significant contribution to the growing literature that traces the roots of Europe’s economic rise to the climatic and population shocks of the late medieval period. This review essay discusses the empirical, historical and theoretical support for Campbell’s view while highlighting that it struggles to explain why these positive effects were limited to Europ...
متن کاملAnalysis of Wavelet Transform Implementations for Image and Texture Coding Applications in Programmable Platforms
This paper compares various software implementations of the 2-D binary-tree wavelet decomposition by analyzing the data-related cache penalties in processor-based platforms. Such penalties appear to be the dominant factors that determine performance in this type of applications. The comparisons include various image-scanning techniques, from the classical Row-Column approach to the Local Wavele...
متن کاملFault Management in Map-Reduce Through Early Detection of Anomalous Nodes
Map-Reduce frameworks such as Hadoop have built-in fault-tolerance mechanisms that allow jobs to run to completion even in the presence of certain faults. However, these jobs can experience severe performance penalties under faulty conditions. In this paper, we present Fault-Managed Map-Reduce (FMR) which augments Hadoop with the functionality to mitigate job execution time penalties. FMR uses ...
متن کامل